A near optimal scheduler for on-demand data broadcasts
نویسندگان
چکیده
منابع مشابه
Stretch-optimal scheduling for on-demand data broadcasts
In order to effectively utilize the broadcast bandwidth, it is necessary to have efficient on-line scheduling algorithms that can balance individual and overall performance and can scale in terms of database sizes and client populations. Moreover, the scheduling algorithm should be applicable to a heterogeneous environment where data items have different sizes. We address these issues in this p...
متن کاملDynamic Skyscraper Broadcasts for Video-on-Demand
Skyscraper Broadcasting is a recently proposed statically scheduled broadcast technique for video-on-demand that addresses the network-I/O bottleneck to provide signiicantly superior performance over previous approaches. This paper deenes a scheme for dynamically scheduling the objects that are broadcast on the skyscraper channels. The dynamic broadcasting scheme is designed to provide all clie...
متن کاملA Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service (QoS) network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implementation so that packets can be processed at the speed of the transmission link. The Earliest-DeadlineFirst (EDF) scheduler is the optimal scheduler for bounded-delay services in the sense that it provides the tightest d...
متن کاملNear Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads
We present a work-stealing algorithm for runtime scheduling of dataparallel operations in the context of shared-memory architectures on data sets with highly-irregular workloads that are not known a priori to the scheduler. This scheduler can parallelize loops and operations expressible with a parallel reduce or a parallel scan. The scheduler is based on the work-stealing tree data structure, w...
متن کاملA Cost-Efficient Scheduling Algorithm of On-Demand Broadcasts
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.03.031